Skip to main content

The structure of divide and conquer algorithms

Item Preview

texts
The structure of divide and conquer algorithms


Published March 1983
SHOW MORE


"NPS-52-83-002."

"March 1983."

Cover title

Includes bibliographic references (p. 36-37)

"Prepared for: Chief of Naval Research; Arlington, VA 22217."

Technical report; 1983

The structure of divide and conquer algorithms is represented by program schemes which provide a kind of normal-form for expressing these algorithms. A theorem relating the correctness of a divide and conquer algorithm to the correctness of its subalgorithms is given. Several strategies for designing divide and conquer algorithms for sorting a list of numbers, evaluating a propositional formula, and forming the cartesian product of two sets. (Author)


Publisher Monterey, California : Naval Postgraduate School
Pages 46
Language en_US
Call number ocm80342886
Digitizing sponsor Naval Postgraduate School, Dudley Knox Library
Book contributor Naval Postgraduate School, Dudley Knox Library
Collection navalpostgraduateschoollibrary; fedlink; americana

Full catalog record MARCXML

[Open Library icon]This book has an editable web page on Open Library.

comment
Reviews

There are no reviews yet. Be the first one to write a review.
SIMILAR ITEMS (based on metadata)
Department of Defense
by Smith, Douglas R.
texts
eye 36
favorite 0
comment 0
Department of Defense
texts
eye 22
favorite 0
comment 0
Naval Postgraduate School, Dudley Knox Library
texts
eye 175
favorite 0
comment 0
Naval Postgraduate School, Dudley Knox Library
by Smith, Douglas R.
texts
eye 126
favorite 0
comment 0
Naval Postgraduate School, Dudley Knox Library
texts
eye 177
favorite 0
comment 0
Naval Postgraduate School, Dudley Knox Library
texts
eye 212
favorite 0
comment 0